A Shared Memory Module for Asynchronous Arrays of Processors

نویسندگان

  • Michael J. Meeuwsen
  • Zhiyi Yu
  • Bevan M. Baas
چکیده

A shared memory module connecting multiple independently clocked processors is presented. The memory module itself is independently clocked, supports hardware address generation, mutual exclusion, and multiple addressing modes. The architecture supports independent address generation and data generation/consumption by different processors which increases efficiency and simplifies programming for many embedded and DSP tasks. Simultaneous access by different processors is arbitrated using a least-recently-serviced priority scheme. Simulations show high throughputs over a variety of memory loads. A standard cell implementation shares an 8K-word SRAM among four processors, and can support a 64K-word SRAM with no additional changes. It cycles at 555MHz and occupies 1.2mm2 in 0.18 μm CMOS.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Performance Evaluation of Multi-Processors Organization with Shared Memories

This paper is primarily concerned with theoretical evaluation of the performance of multiprocessors system. A markovian waiting line model has been developed for various different multi-processors configurations, with shared memory. The system is analysed at the request level rather than job level.

متن کامل

A Shared � Memory Multiprocessor Implementation of Data � Parallel

We have designed and implemented an asynchronous data parallel scheduler for the SML NJ ML com piler Using this general scheduler we built a data parallel module that provides new operators to ma nipulate sequences i e arrays vectors in parallel Parallelization concerns such as thread creation and synchronization are hidden from the application programmer by ML s module abstraction We nd that l...

متن کامل

Design and Performance of SMPs With Asynchronous Caches

Asynchronous, cache coherence, shared-memory multiprocessor, SMP We propose and evaluate a cache-coherent symmetric multiprocessor system (SMP) based on asynchronous caches. In a system with asynchronous caches, processors and memory controllers may observe the same coherence request at different points in time. All protocol transactions are unidirectional and processors do not report snoop res...

متن کامل

Chaudhuri Scribe : Aaron Sterling 1 Introduction

The main objective of this lecture is to prove a lower bound on the number of registers (variables) required for any distributed algorithm that solves the Mutual Exclusion problem. We will work in an asynchronous shared memory model. Recall that Peterson’s Algorithm on n processors solves Mutual Exclusion by using two arrays, each of size n. So 2n is an upper bound on the number of registers ne...

متن کامل

Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems

A fundamental problem in distributed computing is performing a set of tasks despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processors. This paper studies the efficiency of emulating shared-memory task-performing algorithms on asynchronous message-passing processors with quantifiable message latency. Efficiency is measured in terms of work...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • EURASIP J. Emb. Sys.

دوره 2007  شماره 

صفحات  -

تاریخ انتشار 2007